Its: an Ilp-based Combined Instruction/task Static Scheduling Algorithm
نویسندگان
چکیده
Our combined task and instruction static scheduling algorithm implemented in the COINS compiler uses an Integer Linear Programming model to find a schedule for a program on a symmetric multiprocessor system-on-chip. We compare our work to state of the art approaches and on average we find a speedup as high as 1.49 compared to a static task scheduling approach without instruction scheduling. Depending on the computation to communication ratio of the application we estimate an average speedup of 2.55 to 2.63 in application execution time compared to sequential code.
منابع مشابه
Code Size Aware Compilation for Real-Time Applications
Statically constructed plan of execution (POE) and aggressive instruction level parallelism (ILP) exploitation make EPIC/VLIW processors appropriate for high performance real-time systems. On the one hand, the compiler controlled POE makes the worst-case execution-time (WCET) analysis more accurate as run-time variations are minimized. On the other hand, the compiler can leverage ILP optimizati...
متن کاملA Comparative Analysis Between EPIC Static Instruction Scheduling and DTSVLIW Dynamic Instruction Scheduling
To achieve performance, Explicitly Parallel Instruction Computing (EPIC) systems take the responsibility of extracting instruction-level parallelism (ILP) from the hardware and give it to the compiler. They expose a large part of the hardware control at the conventional machine level. Dynamically Trace Scheduled VLIW (DTSVLIW) systems, on the other hand, leave the responsibility of extracting...
متن کاملA New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm
This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...
متن کاملInteger Linear Programming vs . Graph - Based Methods inCode
A common characteristic of many embedded applications is that they are aimed at the high-volume consumer market, which is extremely cost-sensitive. However many of them impose stringent performance demands on the underlying system. Therefore, the code generation must take into account the restrictions and features given by the target architecture while satisfying these performance demands. High...
متن کاملInteger Linear Programming vs. Graph-based Methods in Code Generation
A common characteristic of many embedded applications is that they are aimed at the high volume consumer market which is extremely cost sensitive However many of them impose stringent performance demands on the underlying system Therefore the code gen eration must take into account the restrictions and features given by the target architecture while satisfying these performance demands High lev...
متن کامل